#include <iostream>
#include <bits/stdc++.h>
using namespace std;
constexpr int MAXV = 100;
int d[MAXV][MAXV];
int V;
void warshall_floyd() {
    for (int k = 0; k < V; k++)
        for (int i = 0; i < V; i++) 
            for (int j = 0; j < V; j++)
                d[i][j] = min(d[i][j],d[i][k] + d[k][j]);
}


